On the arrangement graphCHIANG, W.-K; CHEN, R.-J.Information processing letters. 1998, Vol 66, Num 4, pp 215-219, issn 0020-0190Article

The Spanning Diameter of the Star GraphsLIN, Cheng-Kuan; HUANG, Hua-Min; HSU, D. F et al.International Symposium on Parallel Architectures, Algorithms, and Networks. 2004, pp 551-556, isbn 0-7695-2135-5, 1Vol, 6 p.Conference Paper

The spanning diameter of the star graphsLIN, Cheng-Kuan; HUANG, Hua-Min; HSU, D. F et al.International Symposium on Parallel Architectures, Algorithms, and Networks. 2004, pp 551-556, isbn 0-7695-2135-5, 1Vol, 6 p.Conference Paper

Routing function and deadlock avoidance in a star graph interconnection networkMISIC, J; JOVANOVIC, Z.Journal of parallel and distributed computing (Print). 1994, Vol 22, Num 2, pp 216-228, issn 0743-7315Article

Indirect star-type networks for large multiprocessor systemsLEE, K. Y; YOON, H.IEEE transactions on computers. 1991, Vol 40, Num 11, pp 1277-1282, issn 0018-9340Article

Embedding meshes on the star graphSANJAY RANKA; JHY-CHUN WANG; NANGKANG YEH et al.Journal of parallel and distributed computing (Print). 1993, Vol 19, Num 2, pp 131-135, issn 0743-7315Article

Replacing cliques by stars in quasi-median graphsHUBER, Katharina T; MOULTON, Vincent; SEMPLE, Charles et al.Discrete applied mathematics. 2004, Vol 143, Num 1-3, pp 194-203, issn 0166-218X, 10 p.Article

High-temperature series expansions for random-bond Potts models on Z^dHELLMUND, Meik; JANKE, Wolfhard.Computer physics communications. 2002, Vol 147, Num 1-2, pp 435-438, issn 0010-4655, 4 p.Conference Paper

On the number of spanning trees of multi-star related graphsNIKOLODOULOS, S. D; RONDOGIANNIS, P.Information processing letters. 1998, Vol 65, Num 4, pp 183-188, issn 0020-0190Article

Edge-forwarding index of star graphs and other Cayley graphsGAUYACQ, G.Discrete applied mathematics. 1997, Vol 80, Num 2-3, pp 149-160, issn 0166-218XArticle

Asteroidal sets in graphsKLOKS, T; KRATSCH, D; MÜLLER, H et al.Lecture notes in computer science. 1997, pp 229-241, issn 0302-9743, isbn 3-540-63757-5Conference Paper

The 4-star graph is not a subgraph of any hypercubeXIAOJUN SHEN; WING HU; SUDBOROUGH, H et al.Information processing letters. 1993, Vol 45, Num 4, pp 199-203, issn 0020-0190Article

A depth-first search routing algorithm for star graphs and its performance evaluationSUR, S; SRIMANI, P. K.Mathematical and computer modelling. 1994, Vol 19, Num 9, pp 35-52, issn 0895-7177Article

All trees are 1-embeddable and all except stars are 2-embeddableCLAPHAM, C. R. J; SHEEHAN, J.Discrete mathematics. 1993, Vol 120, Num 1-3, pp 253-259, issn 0012-365XArticle

The cost of broadcasting on star graphs and k-ary hypercubesGRAHAM, S. W; SEIDEL, S. R.IEEE transactions on computers. 1993, Vol 42, Num 6, pp 756-759, issn 0018-9340Article

Subtree and substar intersection numbersYI-WU CHANG; JACOBSON, M. S; MONMA, C. L et al.Discrete applied mathematics. 1993, Vol 44, Num 1-3, pp 205-220, issn 0166-218XArticle

Crossing stars in topological graphsTARDOS, Gabor; TOTH, Géza.Lecture notes in computer science. 2005, pp 184-197, issn 0302-9743, isbn 3-540-30467-3, 1Vol, 14 p.Conference Paper

Embedding star networks into hypercubesBETTAYEB, S; CONG, B; GIROU, M et al.IEEE transactions on computers. 1996, Vol 45, Num 2, pp 186-194, issn 0018-9340Article

On some properties and algorithms for the star and pancake interconnection networksKE QIU; AKL, S. G; MEIJER, H et al.Journal of parallel and distributed computing (Print). 1994, Vol 22, Num 1, pp 16-25, issn 0743-7315Article

The Ramsey numbers for disjoint unions of treesBASKORO, E. T; HASMAWATI; ASSIYATUN, H et al.Discrete mathematics. 2006, Vol 306, Num 24, pp 3297-3301, issn 0012-365X, 5 p.Article

The acircuitic directed star arboricity of subcubic graphs is at most fourPINLOU, Alexandre; SOPENA, Eric.Discrete mathematics. 2006, Vol 306, Num 24, pp 3281-3289, issn 0012-365X, 9 p.Article

Edge-bipancyclicity of star graphs under edge-fault tolerantMIN XU; HU, Xiao-Dong; QIANG ZHU et al.Applied mathematics and computation. 2006, Vol 183, Num 2, pp 973-979, issn 0096-3003, 7 p.Article

On the spanning w-wide diameter of the star graphLIN, Cheng-Kuan; HUANG, Hua-Min; HSU, D. Frank et al.Networks (New York, NY). 2006, Vol 48, Num 4, pp 235-249, issn 0028-3045, 15 p.Article

Wiener index versus maximum degree in treesFISCHERMANN, Miranca; HOFFMANN, Arne; RAUTENBACH, Dieter et al.Discrete applied mathematics. 2002, Vol 122, Num 1-3, pp 127-137, issn 0166-218XArticle

On strong Menger-connectivity of star graphsEUNSEUK OH; JIANER CHEN.Lecture notes in computer science. 2001, pp 272-283, issn 0302-9743, isbn 3-540-42707-4Conference Paper